Breadth-first search

Results: 170



#Item
51Search algorithms / Automated planning and scheduling / Graphplan / Breadth-first search / STRIPS / Algorithm / Graph / Action description language / Partial-order planning / Mathematics / Graph theory / Artificial intelligence

Fast Planning Through Planning Graph Analysis∗ Merrick L. Furst School of Computer Science Carnegie Mellon University Pittsburgh PA

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2005-05-06 11:34:56
52Computing / Distributed computing / Peer-to-peer / BitTorrent / Gnutella / Ono / Breadth-first search / Network coding / Distributed hash table / File sharing networks / Distributed data storage / Concurrent computing

Microsoft Word - CCD_p-to-q_JSACPaper_TechnicalReport.doc

Add to Reading List

Source URL: www.eee.hku.hk

Language: English - Date: 2012-06-13 00:42:15
53Search algorithms / Pursuit-evasion / game theory / Shortest path problem / NP-complete / Planar graph / Breadth-first search / Binary tree / Depth-first search / Graph theory / Theoretical computer science / Mathematics

On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi

Add to Reading List

Source URL: www.cim.mcgill.ca

Language: English - Date: 2013-05-18 17:31:04
54NP-complete problems / Graph partition / Clique / Graph coloring / Vertex / Connected component / Breadth-first search / Connectivity / Tree / Graph theory / Theoretical computer science / Mathematics

Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2013-03-13 14:59:55
55Sampling / Survey methodology / Estimation theory / Snowball sampling / Small-world network / Breadth-first search / Computer cluster / Computing / Statistical inference / Statistics

Sampling Bias in User Attribute Estimation of OSNs Hosung Park Sue Moon Department of Computer Science

Add to Reading List

Source URL: an.kaist.ac.kr

Language: English - Date: 2013-08-21 11:49:59
56Consensus / Wireless sensor network / Distributed computing / Connectivity / Network topology / Communication complexity / Breadth-first search / Binary tree / Rope / Theoretical computer science / Applied mathematics / Computing

The Cost of Fault Tolerance in Multi-Party Communication Complexity∗ Haifeng Yu National University of Singapore Singapore

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2012-05-17 05:45:49
57Degree distribution / Bridge / Graph / Breadth-first search / Graph theory / Mathematics / Combinatorics

Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge arXiv:1102.4374v1 [cs.CR] 22 FebArvind Narayanan

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-02-22 21:26:17
58Distributed computing / Chord / Routing / Sybil attack / Peer-to-peer / Node / Breadth-first search / Small world routing / Kademlia / Distributed data storage / Computing / Concurrent computing

In Proceedings of the ACM SIGCOMM Conference on Computer Communications (SIGCOMM 2006), Pisa, Italy, September 2006 SybilGuard: Defending Against Sybil Attacks via Social Networks Haifeng Yu

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2006-11-02 03:38:56
59Binary trees / Wireless networking / Network topology / Connectivity / B-tree / Breadth-first search / Distributed computing / Wireless sensor network / Rope / Theoretical computer science / Computing / Applied mathematics

The Cost of Fault Tolerance ∗ in Multi-Party Communication Complexity Binbin Chen Haifeng Yu

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2012-05-14 11:38:21
60Operations research / Search algorithms / Network flow / Routing algorithms / Canadian traveller problem / Shortest path problem / Breadth-first search / Flow network / Tree / Graph theory / Mathematics / Theoretical computer science

Canadians Should Travel Randomly⋆ Erik D. Demaine1 , Yamming Huang2 , Chung-Shou Liao2 , and Kunihiko Sadakane3 1 Computer Science and Artificial Intelligence Laboratory,

Add to Reading List

Source URL: erikdemaine.org

Language: English - Date: 2014-06-27 14:12:19
UPDATE